A Provably Consistent Method for Imposing Sparsity in Featurebased SLAM Information Filters.” To appear

is the development of algorithms which scale with the size of the environment. A few promising methods exploit the key insight that representing the posterior in the canonical form parameterized by a sparse information matrix provides signicant advantages regarding computational eciency and storage requirements. Because the information matrix is naturally dense in the case of feature-based SLAM, addi-tional steps are necessary to achieve sparsity. The delicate issue then becomes one of performing this sparsication in a manner which is consistent with the original distribution. In this paper, we present a SLAM algorithm based in the information form in which sparseness is preserved while maintaining consistency. We describe an intuitive approach to controlling the population of the information matrix by essentially ig-noring a small fraction of proprioceptive measurements whereby we track a modied version of the posterior. In this manner, the Exactly Sparse Extended Information Filter (ESEIF) performs exact inference, employing a model which is conservative relative to the standard distribution. We demonstrate our algorithm both in simula-tion as well as on two nonlinear datasets, comparing it against the standard EKF as well as the Sparse Extended Information Filter (SEIF) by Thrun et al. The results convincingly show that our method yields conservative estimates for the robot pose and map which are nearly identical to those of the EKF in comparison to the SEIF formulation which results in overcondent error bounds